On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations

نویسندگان

  • Flavio Ferrarotti
  • Sven Hartmann
  • Sebastian Link
چکیده

Recently, an axiomatization for functional dependencies (FDs) and multivalued dependencies (MVDs) has been established where arbitrary attributes can be specified as NOT NULL. That is, the information stored over such attributes must not be incomplete. The axiomatization subsumes previous axiomatizations of FDs and MVDs where every attribute is declared to be NOT NULL, and where no attribute is declared to be NOT NULL. We establish axiomatizations which underpin formally the intuition that the complementation rule is a mere means of database normalization. The results unburden the existing theory of the strong assumption that all attributes are known at the time when the dependencies are specified. The findings extend and unify previous results for the special cases above.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Implication of Multivalued Dependencies in Partial Database Relations

The implication of multivalued dependencies (MVDs) in relational databases has originally and independently been denned in the context of some fixed finite universe by Delobel, Fagin, and Zaniolo. Biskup observed that the original axiomatisation for MVD implication does not reflect the fact that the complementation rule is merely a means to achieve database normalisation. He proposed two altern...

متن کامل

INCOMPLETE INTERVAL-VALUED HESITANT FUZZY PREFERENCE RELATIONS IN DECISION MAKING

In this article, we propose a method to deal with incomplete interval-valuedhesitant fuzzy preference relations. For this purpose, an additivetransitivity inspired technique for interval-valued hesitant fuzzypreference relations is formulated which assists in estimating missingpreferences. First of all, we introduce a condition for decision makersproviding incomplete information. Decision maker...

متن کامل

Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes

We study inference systems for the combined class of functional and full hierarchical dependencies in relational databases. Two notions of implication are considered: the original version in which the underlying set of attributes is fixed, and the alternative notion in which this set is left undetermined. The first main result establishes a finite axiomatisation in fixed universes which clarifi...

متن کامل

On Inferences of Full Hierarchical Dependencies

Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its projections without loss of information. Therefore, FHDs generalise multivalued dependencies (MVDs) in which case the number of these projections is precisely two. The implication of FHDs has been defined in the contex...

متن کامل

An annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies

A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010